Search results for "Selection algorithm"
showing 8 items of 8 documents
Deployment of the ATLAS high level trigger
2005
The ATLAS combined test beam in the second half of 2004 saw the first deployment of the ATLAS high-level triggers (HLT). The next steps are deployment on the pre-series farms in the experimental area during 2005, commissioning and cosmics tests in 2006 and collisions in 2007. This paper reviews the experience gained in the test beam, describes the current status and discusses the further enhancements to be made. We address issues related to the dataflow, selection algorithms, testing, software distribution, installation and improvements
SELECTING HERB-RICH FOREST NETWORKS TO PROTECT DIFFERENT MEASURES OF BIODIVERSITY
2001
Data on vascular plants of herb-rich forests in Finland were used to compare the efficiency of reserve selection methods in representing three measures of biodiversity: species richness, phylogenetic diversity, and restricted-range diversity. Comparisons of reserve selection methods were carried out both with and without consideration of the existing reserve system. Our results showed that the success of a reserve network of forests in representing different measures of biodiversity depends on the selection procedure, selection criteria, and data set used. Ad hoc selection was the worst option. A scoring procedure was generally more efficient than maximum random selection. Heuristic methods…
Policy-based channel access mechanism selection for QoS provision in IEEE 802.11e
2007
The appearance of the 802.11e standard made the 802.11 wireless local area networks (WLANs) capable of providing different levels of quality of service (QoS). This standard defines two new channel access mechanisms (CAMs), namely the enhanced distributed channel access (EDCA) and the HCF controlled channel access (HCCA). The introduction of two CAMs increases the complexity of traffic management, since now not only the available resources have to be distributed, but also the optimal CAM for each data flow has to be selected. However, the best CAM selection algorithm is still not clear. This paper presents and analyses different CAM selection policies in order to derive the best-suited strat…
Licensed and Unlicensed Spectrum Management for Energy-Efficient Cognitive M2M
2020
Edge computing has emerged as a promising solution for relieving the tension between resource-limited MTDs and computational-intensive tasks. To realize successful task offloading with limited spectrum, we focus on the cognitive machine-to-machine (CM2M) paradigm which enables a massive number of MTDs to either opportunistically use the licensed spectrum that is temporarily available, or to exploit the under-utilized unlicensed spectrum. We formulate the channel selection problem with both licensed and unlicensed spectrum as an adversarial multi-armed bandit (MAB) problem, and combine the exponential-weight algorithm for exploration and exploitation (EXP3) and Lyapunov optimization to devel…
An efficient method for fully automatic 3D digitization of unknown objects
2013
Our goal is to develop a complete and automatic scanning strategy with minimum prior information about the object shape. We aim to establish a methodology for the automation of the 3D digitization process. The paper presents a novel approach to determine the Next Best View (NBV) for an efficient reconstruction of highly accurate 3D models. Our method is based on the classification of the acquired surfaces into Well Visible and Barely Visible combined with a best view selection algorithm based on mean shift, which avoids unreachable positions. Our approach is applicable to all kinds of range sensors. To prove the efficiency and the robustness of our method, test objects are first scanned man…
Notice of Violation of IEEE Publication Principles<BR>An adaptive routing mechanism for P2P resource discovery
2005
The key to the usability of large-scale decentralize peer-to-peer (P2P) systems, and one of the most challenge design aspects, is efficient mechanism for distributed resource discovery. Unstructured P2P networks are very attractive because they do not suffer the limitations of centralized systems an the drawbacks of highly structured approaches. However the search algorithms are usually based on simple flooding scheme generating large loads on the network participants. In this paper to address this major limitation, we present the design an evaluation of an innovative searching protocol in unstructured P2P networks. The approach aims at dynamically adapting the network topology to peers' in…
Deployment of the ATLAS High-Level Trigger
2006
The ATLAS combined test beam in the second half of 2004 saw the first deployment of the ATLAS High-Level Trigger (HLT). The next steps are deployment on the pre-series farms in the experimental area during 2005, commissioning and cosmics tests with the full detector in 2006 and collisions in 2007. This paper reviews the experience gained in the test beam, describes the current status and discusses the further enhancements to be made. We address issues related to the dataflow, integration of selection algorithms, testing, software distribution, installation and improvements.
Cooperative Medium Access Control in Wireless Networks: The Two-Hop Case
2009
Cooperative communication has been recently proposed as a powerful means to improve network performance in wireless networks. However, most existing work focuses solely on one-hop source-destination cooperation. In this paper, we propose a novel cooperative MAC mechanism that is specially designed for two-hop cooperation communications where the source node and the destination node cannot hear each other directly. In this case, cooperative communication is operated in a two-hop manner and transmit-diversity is achieved by the reception of the same data packet forwarded through multiple relays towards a single destination. The proposed scheme employs an efficient relay selection algorithm to…